Inductive Synthesis of Recursive Logic Programs: Achievements and Prospects
نویسندگان
چکیده
The inductive synthesis of recursive logic programs from incomplete information, such as input/output examples, is a challenging subfield both of ILP (Inductive Logic Programming) and of the synthesis (in general) of logic programs from formal specifications. We first overview past and present achievements, focusing on the techniques that were designed specifically for the inductive synthesis of recursive logic programs, but also discussing a few general ILP techniques that can also induce non-recursive hypotheses. Then we analyse the prospects of these techniques in this task, investigating their applicability to software engineering as well as to knowledge acquisition and discovery.
منابع مشابه
Inductive Program Synthesis as Induction of Context - Free Tree Grammars
We present an application of grammar induction in the domain of inductive program synthesis. Synthesis of recursive programs from input/output examples involves the solution of two subproblems: transforming examples into straightforward programs and folding straightforward programs into (a set of) recursive equations. In this paper we focus on the second part of the synthesis problem, which cor...
متن کاملInductive Synthesis of Recursive Programs – A Comparison of Three Systems
The paper we present compares the three systems for program synthesis, namely Adate, an approach through evolutionary computation, the inductive/abductive logic program synthesizer Dialogs-II and the classification learner Atre, capable of simultaneously learning mutually dependent, recursive target predicates. It gives an overview over the functionality of all three systems, and evaluates thei...
متن کاملInductive Logic Program Synthesis with DIALOGS
DIALOGS (Dialog-based Inductive and Abductive LOGic program Synthesizer) is a schema-guided synthesizer of recursive logic programs; it takes the initiative and minimally queries a (possibly computationally naive) specifier for evidence in her/his conceptual language. The specifier must know the answers to such simple queries, because otherwise s/he wouldn’t even feel the need for the synthesiz...
متن کاملA Unifying Framework for Analysis and Evaluation of Inductive Programming
In this paper we present a comparison of several inductive programming (IP) systems. IP addresses the problem of learning (recursive) programs from incomplete specifications, such as input/output examples. First, we introduce conditional higher-order term rewriting as a common framework for inductive logic and inductive functional program synthesis. Then we characterise the several ILP systems ...
متن کاملCompleting open logic programs by constructive induction
We consider part of the problem of schema-biased inductive synthesis of recursive logic programs from incomplete speciications, such as clausal evidence (for instance, but not necessarily , ground positive and negative examples). After synthesizing the base clause and introducing recursive call(s) to the recursive clause, it remains to combine the overall result from the partial results obtaine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Program.
دوره 41 شماره
صفحات -
تاریخ انتشار 1999